Interactive Topological Drawing
نویسنده
چکیده
The research presented here examines topological drawing, a new mode of constructing and interacting with mathematical objects in three-dimensional space. In topological drawing, issues such as adjacency and connectedness, which are topological in nature, take precedence over purely geometric issues. Because the domain of application is mathematics, topological drawing is also concerned with the correct representation and display of these objects on a computer. By correctness we mean that the essential topological features of objects are maintained during interaction. We have chosen to limit the scope of topological drawing to knot theory, a domain that consists essentially of one class of object (embedded circles in three-dimensional space) yet is rich enough to contain a wide variety of difficult problems of research interest. In knot theory, two embedded circles (knots) are considered equivalent if one may be smoothly deformed into the other without any cuts or self-intersections. This notion of equivalence may be thought of as the heart of knot theory. We present methods for the computer construction and interactive manipulation of a wide variety of knots. Many of these constructions would be difficult using standard computer-aided drawing methods. Interactive techniques allow for knot simplification under topological constraints from complicated conformations to simpler embeddings. These methods have proven useful in the investigation of the knot equivalence problem. As a further test of its utility, topological drawing has been used for several knot theoretical applications. The first of these involves finding the stick-number of a knot (the fewest number of straight sticks needed to form the knot). A second application is to the relaxation of knots under a physically-based knot energy (the symmetric energy) that we find effectively simplifies knots to configurations approaching their “canonical form”. Finally, our
منابع مشابه
Driving Interactive Graph Exploration Using 0-Dimensional Persistent Homology Features
Graphs are commonly used to encode relationships among entities, yet, their abstractness makes them incredibly difficult to analyze. Node-link diagrams are a popular method for drawing graphs. Classical techniques for the node-link diagrams include various layout methods that rely on derived information to position points, which often lack interactive exploration functionalities; and force-dire...
متن کاملInteractive Graph Layout of a Million Nodes
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of...
متن کاملInteractive Orthogonal Graph Drawing
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenaria, p...
متن کاملThe Complexity of Several Realizability Problems for Abstract Topological Graphs
topological graph (AT-graph): A = (G, R); G = (V, E) is a graph, R ⊆ ( E 2 ) in a topological graph T ... RT = set of crossing pairs of edges AT-graph A is realizable if there exists a topological graph T which is a drawing of G and RT = R. simply realizable ... T is simple rectilinearly realizable ... edges of T are straight-line segments weakly realizable ... RT ⊆ R Abstract topological graph...
متن کاملgraphTPP: A multivariate based method for interactive graph layout and analysis
Graph layout is the process of creating a visual representation of a graph through a node-link diagram. Node-attribute graphs have additional data stored on the nodes which describe certain properties of the nodes called attributes. Typical force-directed representations often produce hairball-like structures that neither aid in understanding the graph’s topology nor the relationship to its att...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998